infinite connectivity

См. также в других словарях:

• Percolation threshold — is a mathematical term related to percolation theory, which is the formation of long range connectivity in random systems. In engineering and coffee making, percolation is the slow flow of fluids through porous media, but in the mathematics and… …   Wikipedia

• Menger's theorem — In the mathematical discipline of graph theory and related areas, Menger s theorem is a basic result about connectivity in finite undirected graphs. It was proved for edge connectivity and vertex connectivity by Karl Menger in 1927. The edge… …   Wikipedia

• Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges …   Wikipedia

• Mandelbrot set — Initial image of a Mandelbrot set zoom sequence with a continuously coloured environment …   Wikipedia

• Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

• Finite topological space — In mathematics, a finite topological space is a topological space for which the underlying point set is finite. That is, it is a topological space for which there are only finitely many points.While topology is mostly interesting only for… …   Wikipedia

• Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… …   Wikipedia

• Hypohamiltonian graph — In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.HistoryHypohamiltonian graphs were first… …   Wikipedia

• Connected space — For other uses, see Connection (disambiguation). Connected and disconnected subspaces of R² The green space A at top is simply connected whereas the blue space B below is not connected …   Wikipedia

• Zune — This article is about the digital media brand. For the AROS widget toolkit, see Zune (widget toolkit). Zune Manufacturer Microsoft Release date …   Wikipedia

• Nano brain — A nano brain[1] [1] is a conceptual device that executes massively parallel computing following the information processing principles of human brain. This machine assembly would serve as an intelligent decision making unit for the nano… …   Wikipedia